Multimodal surface matching with higher-order smoothness constraints
نویسندگان
چکیده
منابع مشابه
Multimodal surface matching with higher-order smoothness constraints
In brain imaging, accurate alignment of cortical surfaces is fundamental to the statistical sensitivity and spatial localisation of group studies, and cortical surface-based alignment has generally been accepted to be superior to volume-based approaches at aligning cortical areas. However, human subjects have considerable variation in cortical folding, and in the location of functional areas re...
متن کاملGeometric Polynomial Constraints in Higher-Order Graph Matching
Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing affinities beyond the unary and pairwise level. Such higher-order terms have a particular appeal for geometric constraints that include three or more corresponden...
متن کاملAlgebraic Higher-Order Matching
The decidability of algebraic higher-order matching is proved. Algebraic higher-order matching is a matching where the constant term in equation is built of first-order constants and constants of a base type. This result is particularly appealing in the light of the last result of Loader.
متن کاملImage matching with higher-order geometric features.
We propose a geometric matching technique in which line segments and elliptical arcs are used as edge features. The use of these higher-order features renders feature representation efficient. We derive distance measures to evaluate the similarity between the features of the model and those of the image. The model transformation parameters are found by searching a 3-D transformation space using...
متن کاملHigher-Dimensional Packing with Order Constraints
We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional generalizations of scheduling problems. Using graph-theoretic structures to describe feasible solutions, we develop a novel exact branch-and-bound algorithm. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: NeuroImage
سال: 2018
ISSN: 1053-8119
DOI: 10.1016/j.neuroimage.2017.10.037